skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "MacBrough, Ethan"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. We provide a general recursive method for constructing transfer systems on finite lattices. Using this, we calculate the number of homotopically distinct $$N_{\infty} $$ operads for dihedral groups $$D_{p^n}$$, p>2 prime, and cyclic groups $$C_{qp^n}$$, $$p \neq q$$ prime. We then further display some of the beautiful combinatorics obtained by restricting to certain homotopically meaningful $$N_\infty$$ operads for these groups. 
    more » « less
    Free, publicly-accessible full text available January 1, 2026
  2. We investigate the rich combinatorial structure of premodel structures on finite lattices whose weak equivalences are closed under composition. We prove that there is a natural refinement of the inclusion order of weak factorization systems so that the intervals detect these composition closed premodel structures. In the case that the lattice in question is a finite total order, this natural order retrieves the Kreweras lattice of noncrossing partitions as a refinement of the Tamari lattice, and model structures can be identified with certain tricolored trees. 
    more » « less
  3. We isolate a class of groups — called lossless groups — for which homotopy classes of G-Nāˆž operads are in bijection with certain restricted transfer systems on the poset of conjugacy classes Sub(G)/G. 
    more » « less